Lower Bounds for Monotone Counting Cir uits
نویسنده
چکیده
where ce ∈ N = {0, 1, 2, . . .}, and xi = 1. Produ ts ∏n i=1 x ei i are monomials of f ; we will often omit monomials whose oe ients ce are zero. The polynomial is multilinear, if ce = 0 for all e 6∈ {0, 1}n, and is homogeneous of degree d, if e1 + · · ·+ en = d for all e with ce 6= 0. A standard model of ompa t representation of su h polynomials (with nonnegative oe ients) is that of monotone arithmeti ir uits, i.e. of {+,×}ir uits. Su h a ir uit is a dire ted a y li graph with three types of nodes: input, addition (+), and multipli ation (×). Input nodes have
منابع مشابه
Finite Limits and Monotone Computations: The Lower Bounds Criterion
Our main result is a combinatorial lower bounds criterion for monotone circuits over the reals. We allow any unbounded fanin non-decreasing real-valued functions as gates. The only requirement is their "local-ity". Unbounded fanin AND and OR gates, as well as any threshold gate T m s (x 1 ; : : : ; x m) with small enough threshold value minfs; m ? s + 1g, are simplest examples of local gates. T...
متن کاملPotential of the Approximation Method
Since Razborov, based on the approximation method, succeeded to obtain a superpolynomial lower bound on the size of monotone circuits computing the clique function, much effort has been devoted to explore the method and derive good lower bounds[K, NM, R1, R2, RR]. Employing the approximation method, Alon and Boppana[AB] obtained an exponential lower bound for monotone circuits computing the cli...
متن کامل